
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1885. -- [Coi2003]Locomotive -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1885: [Coi2003]Locomotive</h2><span class=green>Time Limit: </span>1 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>64 MB<br><span class=green>Submit: </span>2&nbsp;&nbsp;<span class=green>Solved: </span>2<br>[<a href='submitpage.php?id=1885'>Submit</a>][<a href='problemstatus.php?id=1885'>Status</a>][<a href='bbs.php?id=1885'>Discuss</a>]</center><h2>Description</h2><div class=content><img border="0" src="images/1885.jpg"> </div><h2>Input</h2><div class=content>The first line of the input file contains the numbers N and P, and
a real number D, 2 ≤ N ≤ 100, 1 ≤ P ≤ 3000, 1 ≤ D ≤ 10,000.
The number N is the number of towns, the number P is the number of
railroads, and D is the range of the radio in kilometers (a decimal 
number two digits precise). The towns are numbered 1 to N. Each of
the following N lines contains data describing one town, i.e. two
integers, X and Y, -5000 ≤ X, Y ≤ 5000, representing the town ’ s
coordinates.
Each of the following P lines contains data describing one railroad
track, i.e. two integers G1 and G2, saying there is a railroad
rack connecting G1 i G2.
The next line contains the starting positions of Mirko and Slavku,
the integers U and V. Mirko starts from town U, Slavko from town V.
U and V will represent two towns separated at most D kilometers
in distance.</div><h2>Output</h2><div class=content>The output file should contain the numbers of all the towns Slavko
can reach. These numbers should be sorted in increasing order, each of
them written on a separate line.</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>5 4 1.5<br />
0 1<br />
0 0<br />
4 1<br />
4 0<br />
2 2<br />
1 3<br />
1 5<br />
3 5<br />
2 4<br />
2 1</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>1<br />
3</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search='></a></p></div><center>[<a href='submitpage.php?id=1885'>Submit</a>][<a href='problemstatus.php?id=1885'>Status</a>][<a href='bbs.php?id=1885'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
